On supercharacter theoretic generalizations of monomial groups and Artin's conjecture
نویسندگان
چکیده
We extend the notions of quasi-monomial groups and almost monomial groups, in framework supercharacter theories, we study their connection with Artin's conjecture regarding holomorphy Artin $L$-functions.
منابع مشابه
Proof of a conjecture on monomial graphs
Let e be a positive integer, p be an odd prime, q = p, and Fq be the finite field of q elements. Let f, g ∈ Fq[X,Y ]. The graph G = Gq(f, g) is a bipartite graph with vertex partitions P = F3q and L = F 3 q, and edges defined as follows: a vertex (p) = (p1, p2, p3) ∈ P is adjacent to a vertex [l] = [l1, l2, l3] ∈ L if and only if p2 + l2 = f(p1, l1) and p3 + l3 = g(p1, l1). Motivated by some qu...
متن کاملConstruction of supercharacter theories of finite groups
Much can be learned about a finite group from its character table, but sometimes that table can be difficult to compute. Supercharacter theories are generalizations of character theory, defined by P. Diaconis and I.M. Isaacs in [8], in which certain (possibly reducible) characters called supercharacters take the place of the irreducible characters, and a certain coarser partition of the group t...
متن کاملOn a conjecture about monomial Hénon mappings
A monomial Hénon mapping is defined as the wellknown two-dimensional Hénon map with the quadratic term replaced by a monomial. This paper introduces a conjecture about monomial Hénon mappings: Even Hénon mappings are chaotic and odd Hénon mappings are not chaotic in the first quadrant of the bifurcation parameter space. This conjecture is based on numerical simulations of this type of map.
متن کاملA Note on the Monomial Conjecture
Several cases of the monomial conjecture are proved. An equivalent form of the direct summand conjecture is discussed. Let (A,m, k) be a noetherian local ring of dimension n, m its maximal ideal and k = A/m. The Monomial Conjecture (henceforth MC) of Hochster asserts that, given any system of parameters (henceforth s.o.p.) x1, . . . , xn of A, (x1x2 . . . xn) t−1 / ∈ (x1, . . . , xn) ∀t > 0. Ho...
متن کاملSet - Theoretic Complete Intersection Monomial
In this paper we describe an algorithm for producing infinitely many examples of set-theoretic complete intersection monomial curves in P n+1 , starting with a single set-theoretic complete intersection monomial curve in P n. Moreover we investigate the numerical criteria to decide when these monomial curves can or cannot be obtained via semigroup gluing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2022
ISSN: ['0011-4642', '1572-9141']
DOI: https://doi.org/10.21136/cmj.2022.0352-21